Separating-Plane Perspective Shadow Mapping

نویسنده

  • Morten S. Mikkelsen
چکیده

This paper proposes a real-time hybrid solution between standard shadow mapping and any of the current perspective shadow mapping based methods. Existing methods are known to have undersampling problems. At little extra cost we combine two methods to minimize undersampling errors. This is done by computing a plane equation which separates the two resulting shadow maps to get the best possible area-based sampling density. An additional property of this separation plane is that objects entirely on one side of the plane only need to be rendered into one map.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Light Space Perspective Shadow Maps

In this paper, we present a new shadow mapping technique that improves upon the quality of perspective and uniform shadow maps. Our technique uses a perspective transform specified in light space which allows treating all lights as directional lights and does not change the direction of the light sources. This gives all the benefits of the perspective mapping but avoids the problems inherent in...

متن کامل

Theory to Practice: Generalized Minimum-Norm Perspective Shadow Maps for Anti-aliased Shadow Rendering in 3D Computer Games

Shadow mapping has been extensively used for real-time shadow rendering in 3D computer games, though it suffers from the inherent aliasing problems due to its image-based nature. The aliasing errors in shadow mapping consist of perspective aliasing error and projection aliasing error. In this paper, we propose a novel shadow-map reparameterization to reduce perspective aliasing for varying view...

متن کامل

Real-Time Perspective Optimal Shadow Maps

Shadow mapping is perhaps the most pervasive method for creating convincing shadows in computer graphics. However, because it is an image-space algorithm it must contend with aliasing issues caused by finite and discrete sampling. This exposition differs from previous work on shadow maps in that it pinpoints the one remaining degree of freedom in the shadow mapping process – the angle of the fi...

متن کامل

The Irregular Z-Buffer and its Application to Shadow Mapping

The classical Z-buffer algorithm samples a scene at regularly spaced points on an image plane. We present an extension of this algorithm called the irregular Z-buffer that permits sampling of the scene at arbitrary points on the image plane. The sample points are stored in a two-dimensional spatial data structure which is queried during rasterization. The irregular Z-buffer can be applied to sh...

متن کامل

Pixel-Correct Shadow Maps with Temporal Reprojection and Shadow Test Confidence

Shadow mapping suffers from spatial aliasing (visible as blocky shadows) as well as temporal aliasing (visible as flickering). Several methods have already been proposed for reducing such artifacts, but so far none is able to provide satisfying results in real time. This paper extends shadow mapping by reusing information of previously rasterized images, stored efficiently in a so-called histor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Graphics Tools

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2007